A Genetic Algorithm-Based Task Scheduler for Parallel Processor Systems with Non-negligible Interprocessor Delay
نویسندگان
چکیده
The multiprocessor task scheduling problem is an NP-complete problem that is difficult to solve via traditional methods. Recent investigations have used evolutionary computation to evolve optimized schedules, but have failed to address the effects of communications delay on the schedules. As such, the schedules produced are often less than optimal. The goal of this project was to extend previous research by developing a genetic algorithm that can evolve optimized solutions to complex task scheduling problems for multiple processor systems, while taking into account the non-negligible communications delay that exists between processors.
منابع مشابه
Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملAn Effective Hybrid Genetic Algorithm for Hybrid Flow Shops with Sequence Dependent Setup Times and Processor Blocking
Hybrid flow-shop or flexible flow shop problems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task processing. In many papers the assumptions are generally made that there is unlimited storage available between stages and the setup times a...
متن کاملReal-time network functions for the Internet of Things
The Internet of Things is evolving, more and more devices are getting connected, more data exchanged and increasingly complex tasks are handled by these networks. Especially, low-power wireless communication networks are widely used due to the flexibility and fast deployment with a battery. The networks must be at low cost and still guarantee a long battery life time and compute a complex task....
متن کاملStarvation Free Scheduler for Buffered Crossbar Switches (RESEARCH NOTE)
Need for high speed internet connectivity has lead to a substantial research in switching systems. Buffered crossbar switches have received a lot of attention from both research and industrial communities due of its flexibility and scalability. Designing a scheduling algorithm for buffered crossbar switches without starvation is a major challenge as of now. In this paper, we proposed a Delay ba...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کامل